Bottleneck stability for generalized persistence diagrams
نویسندگان
چکیده
منابع مشابه
Persistence Diagrams as Diagrams: A Categorification of the Stability Theorem
Persistent homology, a central tool of topological data analysis, provides invariants of data called barcodes (also known as persistence diagrams). A barcode is simply a multiset of real intervals. Recent work of Edelsbrunner, Jabłoński, and Mrozek suggests an equivalent description of barcodes as functors R → Mch, where R is the poset category of real numbers and Mch is the category whose obje...
متن کاملAqm Generalized Nyquist Stability in Multiple Bottleneck Networks ?
The influence of multiple bottlenecks on the stability of Active Queue Management (AQM) controllers, usually configured on a single bottleneck basis is discussed. We consider a network scenario where RED is configured at each router according to previously developed control theoretic techniques. These configuration rules assure stability in a single bottleneck scenario. We show that instability...
متن کاملBottleneck Partial-Matching Voronoi Diagrams
Given two point sets in the plane, we study the minimization of the (lexiocographic) bottleneck distance between the smaller set and an equally-sized subset of the larger set under translations. We relate this problem to two Voronoi-type diagrams, which are of interest for related problems. Their complexity is shown to be polynomial in the sizes of the sets and algorithms for their construction...
متن کاملConfidence Sets for Persistence Diagrams
Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features as one varies a tuning parameter. Features with short lifetimes are informally considered to be “topological noise,” and those with a long lifetime are considered to be “topological signal.” In this paper, we bring some statis...
متن کاملBottleneck Partial-Matching Voronoi Diagrams and Applications
Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equallysized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2020
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/14929